Higher-order Transformations and Type Simulations
نویسندگان
چکیده
منابع مشابه
Higher Order Context Transformations
The context transformation and generalized context transformation methods, we introduced recently, were able to reduce zero order entropy by exchanging digrams, and as a consequence, they were removing mutual information between consecutive symbols of the input message. These transformations were intended to be used as a preprocessor for zero-order entropy coding algorithms like Arithmetic or H...
متن کاملProgramming Type-Safe Transformations Using Higher-Order Abstract Syntax
Compiling syntax to native code requires complex code transformations which rearrange the abstract syntax tree. This can be particularly challenging for languages containing binding constructs, and often leads to subtle, hard to find errors. In this paper, we exploit higher-order abstract syntax (HOAS) to implement a type-preserving compiler for thesyntax (HOAS) to implement a type-preserving c...
متن کاملBäcklund transformations for higher order Painlevé equations
Abstract We present a new generalized algorithm which allows the construction of Bäcklund transformations (BTs) for higher order ordinary differential equations (ODEs). This algorithm is based on the idea of seeking transformations that preserve the Painlevé property, and is applied here to ODEs of various orders in order to recover, amongst others, their autoBTs. Of the ODEs considered here, o...
متن کاملHigher Order Geometrical Modeling and Higher Order Field/Current Modeling in FEM, MoM, and PO Simulations
Higher-order, large-domain electromagnetic simulations are presented based on the finite element method (FEM), method of moments (MoM), and physical optics (PO). The simulations combine higher order geometrical modeling and higher order field/current modeling, which is referred to as double-higher-order modeling. The examples demonstrate that accurate and efficient FEM, MoM, and PO simulations ...
متن کاملOn descent for coalgebras and type transformations
We find a criterion for a morphism of coalgebras over a Barr-exact category to be effective descent and determine (effective) descent morphisms for coalgebras over toposes in some cases. Also, we study some exactness properties of endofunctors of arbitrary categories in connection with natural transformations between them as well as those of functors that these transformations induce between co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1988
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/31.6.517